منابع مشابه
Two - Level , Many - Paths
Large-scale natural language generation requires the integration of vast amounts of knowledge: lexical, grammatical, and conceptual. A robust generator must be able to operate well even when pieces of knowledge are missing. It must also be robust against incomplete or inaccurate inputs. To attack these problems, we have built a hybrid generator , in which gaps in symbolic knowledge are lled by ...
متن کاملTwo-level, Many-Paths Generation
Large-scale natural language generation requires the integration of vast amounts of knowledge: lexical, grammatical, and conceptual. A robust generator must be able to operate well even when pieces of knowledge are missing. It must also be robust against incomplete or inaccurate inputs. To attack these problems, we have built a hybrid generator , in which gaps in symbolic knowledge are lled by ...
متن کاملMany-to-many disjoint paths in hypercubes with faulty vertices
This paper considers the problemofmany-to-many disjoint paths in the hypercubeQn with f faulty vertices and obtains the following result. For any integer k with 1 ≤ k ≤ n − 1 and any two sets S and T of k fault-free vertices in different partite sets of Qn (n ≥ 2), if f ≤ 2n−2k−2 and each fault-free vertex has at least two fault-free neighbors, then there exist k fully disjoint fault-free paths...
متن کاملEngineering Time-Dependent Many-to-Many Shortest Paths Computation
Computing distance tables is important for many logistics problems like the vehicle routing problem (VRP). While shortest distances from all source nodes in S to all target nodes in T are time-independent, travel times are not. We present the first efficient algorithms to compute time-dependent travel time tables in large time-dependent road networks. Our algorithms are based on time-dependent ...
متن کاملEfficient Computation of Many-to-Many Shortest Paths
Considering large road networks, we are interested in finding all quickest connections between given source and target locations. The computation of such a distance table is what we call the many-to-many shortest path problem. For several problems in the field of logistics this is an important subtask. For example it is required as an input for vehicle routing problems. Also, distance tables ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l'ACSI
سال: 2021
ISSN: 2562-7589
DOI: 10.29173/cais1197